Comments On "Multipath Matching Pursuit" by Kwon, Wang and Shim
نویسندگان
چکیده
Straightforward combination of tree search with matching pursuits, which was suggested in 2001 by Cotter and Rao, and then later developed by some other authors, has been revisited recently as multipath matching pursuit (MMP). In this comment, we would like to point out some major issues regarding this publication. First, the idea behind MMP is not novel, and the related literature has not been properly referenced. MMP has not been compared to closely related algorithms such as A⋆orthogonal matching pursuit (A⋆OMP). The theoretical analyses do ignore the pruning strategies applied by the authors in practice. All these issues have the potential to mislead the reader and lead to misinterpretation of the results. With this short paper, we intend to clarify the relation of MMP to existing literature in the area and compare its performance with A⋆OMP.
منابع مشابه
Correction to "Generalized Orthogonal Matching Pursuit"
As an extension of orthogonal matching pursuit (OMP) improving the recovery performance of sparse signals, generalized OMP (gOMP) has recently been studied in the literature. In this paper, we present a new analysis of the gOMP algorithm using restricted isometry property (RIP). We show that if the measurement matrix Φ ∈ R satisfies the RIP with δmax{9,S+1}K ≤ 1 8 , then gOMP performs stable re...
متن کاملA New Look at Generalized Orthogonal Matching Pursuit: Stable Signal Recovery under Measurement Noise
Generalized orthogonal matching pursuit (gOMP) is an extension of orthogonal matching pursuit (OMP) algorithm designed to improve the recovery performance of sparse signals. In this paper, we provide a new analysis for the gOMP algorithm for both noiseless and noisy scenarios. We show that if the measurement matrix Φ ∈ R satisfies the restricted isometry property (RIP) with δ7K+N−1 ≤ 0.0231, th...
متن کاملNear optimal bound of orthogonal matching pursuit using restricted isometric constant
As a paradigm for reconstructing sparse signals using a set of under sampled measurements, compressed sensing has received much attention in recent years. In identifying the sufficient condition under which the perfect recovery of sparse signals is ensured, a property of the sensing matrix referred to as the restricted isometry property (RIP) is popularly employed. In this article, we propose t...
متن کاملOblique Projection Matching Pursuit
Recent theory of compressed sensing (CS) tells us that sparse signals can be reconstructed from a small number of random samples. In reconstruction of sparse signals, greedy algorithms, such as the orthogonal matching pursuit (OMP), have been shown to be computationally efficient. In this paper, the performance of OMP is shown to be dependent on how well information of the underlying signals is...
متن کاملA Simple Proof of the Mutual Incoherence Condition for Orthogonal Matching Pursuit
This paper provides a simple proof of the mutual incoherence condition (μ < 1 2K−1 ) under which K-sparse signal can be accurately reconstructed from a small number of linear measurements using the orthogonal matching pursuit (OMP) algorithm. Our proof, based on mathematical induction, is built on an observation that the general step of the OMP process is in essence same as the initial step sin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1507.02826 شماره
صفحات -
تاریخ انتشار 2015